Tables of All Primitive Roots of Odd Primes Less than 1000.
نویسندگان
چکیده
منابع مشابه
The affine primitive permutation groups of degree less than 1000
In this paper we complete the classification of the primitive permutation groups of degree less than 1000 by determining the irreducible subgroups of GL(n, p) for p prime and pn < 1000. We also enumerate the maximal subgroups of GL(8, 2), GL(4, 5) and GL(6, 3). © 2003 Elsevier Science Ltd. All rights reserved. MSC: 20B10; 20B15; 20H30
متن کاملON THE NUMBER OF PRIMES LESS THAN OR EQUAL x
(3) Z I"—1 log p = x log x + 0{x). r-ix\-pJ Since [x/^>]= [[#]/£], it is clear that (3) then holds for all real x>0. We propose to show in this note that the order of w(x) =the number of primes less than or equal x (a result originally due to Tschebyschef, cf. [l]) may be derived very quickly from (3) as a consequence of a general theorem which has no particular relationship to prime numbers. T...
متن کاملThe primitive permutation groups of degree less than 2500
In this paper we use the O’Nan–Scott Theorem and Aschbacher’s theorem to classify the primitive permutation groups of degree less than 2500. MSC: 20B15, 20B10 1 Historical Background The classification of the primitive permutation groups of low degree is one of the oldest problems in group theory. The earliest significant progress was made by Jordan, who in 1871 counted the primitive permutatio...
متن کاملComputer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000
Let p be a prime congruent to 1 modulo 4, and let t, u be rational integers such that (t + u √ p )/2 is the fundamental unit of the real quadratic field Q(√p ). The Ankeny-Artin-Chowla conjecture (AAC conjecture) asserts that p will not divide u. This is equivalent to the assertion that p will not divide B(p−1)/2, where Bn denotes the nth Bernoulli number. Although first published in 1952, this...
متن کاملOn odd primitive graphs
In this paper, we prove that every odd primitive graph must contain two vertex disjoint odd cycles. We also characterize a family of odd primitive graphs whose exponent achieves the upper bound. We follow the notation and terminology of Bondy and Murty [1], unless otherwise stated. A digraph D is said to be primitive if there exists a positive integer k such that for each ordered pair of vertic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1962
ISSN: 0025-5718
DOI: 10.2307/2003069